A Calculus for Semantic Composition and Scoping
نویسنده
چکیده
Certain restrictions on possible scopings of quantified noun phrases in natural language are usually expressed in terms of formal constraints on binding at a level of logical form. Such reliance on the form rather than the content of semantic interpretations goes against the spirit of compositionality. I will show that those scoping restrictions follow from simple and fundamental facts about functional application and abstraction, and can be expressed as constraints on the derivation of possible meanings for sentences rather than constraints of the alleged forms of those meanings. 1 A n O b v i o u s C o n s t r a i n t ? Treatments of quantifier scope in Montague grammar (Montague, 1973; Dowty et al., 1981; Cooper, 1983), transformational grammar (Reinhart, 1983; May, 1985; Helm, 1982; Roberts, 1987) and computational linguistics (Hobbs and Shieber, 1987; Moran, 1988) have depended implicitly or explicitly on a constraint on possible logical forms to explain why examples 1 such as (1) * A woman who saw every man disliked him are ungrammatical, and why in examples such as (2) Every man saw a friend of his (3) Every admirer of a picture of himself is vain the every.., noun phrase must have wider scope than the a... noun phrase if the pronoun in each example is assumed to be bound by its antecedent. What exactly counts as bound anaphora varies between different accounts of the phenomena, but the rough intuition is that semantically a bound pronoun plays the role of a variable bound by the logical form (a quantifier) of its antecedent. Example (1) above is then "explained" by noting that l I n all the examples t ha t follow, the pronoun and its intended antecedent are italicized. As usual, s tarred exampies are supposed to be u n g r m t i c a L its logical form would be something like 3W.WOMAN(W)~ (Vm.MAN(rn) ::~ SAW(W, rn))~
منابع مشابه
Ellipsis and Quantiication: a Substitutional Approach
The paper describes a substitutional approach to ellipsis resolution giving comparable results to (?), but without the need for order-sensitive interleaving of quantiier scoping and ellipsis resolution. It is argued that the order-independence results from viewing semantic interpretation as building a description of a semantic composition, instead of the more common view of interpretation as ac...
متن کاملEllipsis and Quantification: A Substitutional Approach
The paper describes a substitutional approach to ellipsis resolution giving comparable results to (Dalrymple et al., 1991), but without the need for order-sensitive interleaving of quantifier scoping and ellipsis resolution. It is argued that the orderindependence results from viewing semantic interpretation as building a description of a semantic composition, instead of the more common view of...
متن کاملAI planning - based semantic web service composition
Semantic web service composition constitutes the phases namely specification, matchmaking, planning, validation, discovery and execution. As web service composition is categorised as an AI planning problem, the objective of this paper is to propose a fluent calculus approach for the planning phase of the semantic web service composition. Among various methods to solve the AI planning problem, l...
متن کاملSemantic Constraint and QoS-Aware Large-Scale Web Service Composition
Service-oriented architecture facilitates the running time of interactions by using business integration on the networks. Currently, web services are considered as the best option to provide Internet services. Due to an increasing number of Web users and the complexity of users’ queries, simple and atomic services are not able to meet the needs of users; and to provide complex services, it requ...
متن کاملA procedure for Web Service Selection Using WS-Policy Semantic Matching
In general, Policy-based approaches play an important role in the management of web services, for instance, in the choice of semantic web service and quality of services (QoS) in particular. The present research work illustrates a procedure for the web service selection among functionality similar web services based on WS-Policy semantic matching. In this study, the procedure of WS-Policy publi...
متن کاملA Formal Language for Composition
A composition language based on a formal semantic foundation will facilitate precise specification of glue abstractions and compositions, and will support reasoning about their behaviour. The semantic foundation, however, must address a set of requirements like encapsulation, objects as processes, components as abstractions, plug compatibility, a formal object model, and scalability. In this wo...
متن کامل